Monodic temporal logic with quantified propositional variables
نویسندگان
چکیده
منابع مشابه
Monodic temporal logic with quantified propositional variables
We extend the monodic fragment of first-order linear temporal logic to include right-linear grammar operators and quantification of propositional variables. Unlike propositional temporal logic, the use of grammar operators in first-order temporal logic is not equivalent to general propositional quantification, as the latter admit satisfiable formulae without countable models. We consider the de...
متن کاملOn Non-local Propositional and Weak Monodic Quantified CTL
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional PCTL∗, in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified PCTL∗, where the next-time operator can be applied only to formulas with at mo...
متن کاملQuantified Propositional Gödel Logic
It is shown that G ↑ , the quantified propositional Gödel logic based on the truth-value set V↑ = {1− 1/n : n ≥ 1} ∪ {1}, is decidable. This result is obtained by reduction to Büchi’s theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of G ↑ as the intersection of all finite-valued quantified proposition...
متن کاملOn Non-local Propositional and Weak Monodic Quantified
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...
متن کاملA Guide to Quantified Propositional Gödel Logic
Gödel logic is a non-classical logic which naturally turns up in a number of different areas within logic and computer science. By choosing subsets of the unit interval [0, 1] as the underlying set of truthvalues many different Gödel logics have been defined. Unlike in classical logic, adding propositional quantifiers to Gödel logics in many cases increases the expressive power of the logic, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2011
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exr004